Non-overlapping permutation patterns
نویسنده
چکیده
We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is non-overlapping. As a byproduct, we nd some combinatorial identities that are routine to prove using generating functions, but di cult to prove bijectively. Mathematics Subject Classi cation(2010). 05A16, 05A05, 05A10.
منابع مشابه
Generalised Pattern Avoidance
Recently, Babson and Steingŕımsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We will consider pattern avoidance for such patterns, and give a complete solution for the number of permutations avoiding any single pattern of length three with exactly one adjacent pair of letters. For eight...
متن کاملPartially Ordered Generalized Patterns and k-ary Words
Recently, Kitaev [9] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by Babson and Steingrı́msson [1]. A POGP p is a GP some of whose letters are incomparable. In this paper, we study the generating functions (g.f.) for the number of k-ary words avoiding some POGPs. We give analogues, exten...
متن کاملKitaev And
Recently, Kitaev [Ki2] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by Babson and Steingŕımsson [BS]. A POGP p is a GP some of whose letters are incomparable. In this paper, we study the generating functions (g.f.) for the number of k-ary words avoiding some POGPs. We give analogues, ex...
متن کاملStorage capacities of committee machines with overlapping and non-overlapping receptive fields
We present theoretical investigations via the replica theory of the storage capacities of committee machines with a large numberM of hidden units and spherical weights. Difficulties arise in the solution of this problem in the limit of large M . In the case of overlapping receptive fields, as the number of patterns increases, both permutation symmetry and replica symmetry are broken, which lead...
متن کاملT Gopalakrishnan and S Ramakrishnan: Image Encryption in Block-wise with Multiple Chaotic Maps for Permutation and Diffusion
This paper presents an efficient block-wise image encryption method based on multiple chaotic maps. The image is divided into four overlapping blocks and each block is permutated with Cat map and its parameters are controlled by Henon map using multiple keys. Due to overlapping division of blocks, it produces effect of double permutation in the middle portion of overlapped image in single permu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011